Permutation decoding of $${\mathbb {Z}}_2{\mathbb {Z}}_4$$ Z 2 Z 4 -linear codes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Permutation decoding of Z 2 Z 4 - linear codes

An alternative permutation decoding method is described which can be used for any binary systematic encoding scheme, regardless whether the code is linear or not. Thus, the method can be applied to some important codes such as Z2Z4-linear codes, which are binary and, in general, nonlinear codes in the usual sense. For this, it is proved that these codes allow a systematic encoding scheme. As pa...

متن کامل

On Some Classes of $\mathbb{Z}_{2}\mathbb{Z}_{4}-$Linear Codes and their Covering Radius

In this paper we define Z2Z4−Simplex and MacDonald Codes of type α and β and we give the covering radius of these codes.

متن کامل

$\mathbb{Z}_{q}(\mathbb{Z}_{q}+u\mathbb{Z}_{q})$-Linear Skew Constacyclic Codes

In this paper, we study skew constacyclic codes over the ring ZqR where R = Zq + uZq, q = p s for a prime p and u2 = 0. We give the definition of these codes as subsets of the ring ZqR . Some structural properties of the skew polynomial ring R[x, θ] are discussed, where θ is an automorphism of R. We describe the generator polynomials of skew constacyclic codes over R and ZqR. Using Gray images ...

متن کامل

$\mathbb{Z}_p\mathbb{Z}_p[u]$-additive codes

Abstract: In this paper, we study ZpZp[u]-additive codes, where p is prime and u 2 = 0. In particular, we determine a Gray map from ZpZp[u] to Z α+2β p and study generator and parity check matrices for these codes. We prove that a Gray map Φ is a distance preserving map from (ZpZp[u],Gray distance) to (Z α+2β p ,Hamming distance), it is a weight preserving map as well. Furthermore we study the ...

متن کامل

Cyclic codes over $\mathbb{Z}_4+u\mathbb{Z}_4$

In this paper, we have studied cyclic codes over the ring R = Z4 +uZ4, u = 0. We have considered cyclic codes of odd lengths. A sufficient condition for a cyclic code over R to be a Z4-free module is presented. We have provided the general form of the generators of a cyclic code over R and determined a formula for the ranks of such codes. In this paper we have mainly focused on principally gene...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Designs, Codes and Cryptography

سال: 2014

ISSN: 0925-1022,1573-7586

DOI: 10.1007/s10623-014-9946-4